To Preference via Entrenchment
نویسنده
چکیده
We introduce a simple generalization of G ardenfors and Makinson’s epistemic entrenchment called partial entrenchment. We show that preferential inference can be generated as the sceptical counterpart of an inference mechanism de ned directly on partial entrenchment.
منابع مشابه
Transmutations of Knowledge Systems
Within the AGM paradigm revision and contraction operators are constrained by a set of rationality postulates. The logical properties of a set of knowledge are not strong enough to uniquely determine a revision or contraction operation, therefore constructions for these operators rely on some form of underlying preference relation, such as a systems of spheres, or an epistemic entrenchment orde...
متن کاملThe Effects of Corporate Characteristics on Managerial Entrenchment
The present study aims to assess the relationship between some corporate factors and managerial entrenchment in companies listed on the Tehran Stock Exchange during 2011-2017. Panel data regression models were used to test the hypotheses. The obtained results indicated that four corporate factors, namely real earnings management, predictable earnings management, institutional ownership, and boa...
متن کاملThe effect of verb semantic class and verb frequency (entrenchment) on children's and adults' graded judgements of argument-structure overgeneralization errors.
Participants (aged 5-6 yrs, 9-10 yrs and adults) rated (using a five-point scale) grammatical (intransitive) and overgeneralized (transitive causative)(1) uses of a high frequency, low frequency and novel intransitive verb from each of three semantic classes [Pinker, S. (1989a). Learnability and cognition: The acquisition of argument structure. Cambridge, MA: MIT Press]: "directed motion" (fall...
متن کاملRational Elimination of DL-Lite TBox Axioms
An essential task in managing description logic (DL) ontologies is the elimination of problematic axioms. Such elimination is formalised as the operation of contraction in belief change. In this paper, we investigate contraction over DL-LiteR TBoxes. In belief change, a well known approach for defining contraction is via epistemic entrenchments which are preference orderings over formulas. The ...
متن کاملBelief Revision: A Computational Approach
In order to reason about the real world, intelligent systems must have ways of dealing with incomplete and inconsistent information. This issue is addressed in the study of nonmonotonic reasoning, truth maintenance and database update. Belief revision is a formal approach which is central to these areas. This thesis describes a computational approach to the logic of belief revision developed by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 96 شماره
صفحات -
تاریخ انتشار 1999